Bootstrapping the S5 partition function

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Dimer Partition Function

We apply the Ginzburg criterion to the dimer problem and we solve the apparent contradiction of a system with mean field α = 12 , the typical value of tricritical systems, and upper critical dimension Dcr = 6. We find that the system has upper critical dimensionDcr = 6 , while for D ≤ 4 it should undergo a first order phase transition. We comment on the latter wrong result examining the approxi...

متن کامل

The Partition Function Revisited

In 1918, Hardy and Ramanujan wrote their landmark paper deriving the asymptotic formula for the partition function. The paper however was fundamental for another reason, namely for introducing the circle method in questions of additive number theory. Though this method is powerful, it is often difficult and technically complicated to employ. In 2011, Bruinier and Ono discovered a new algebraic ...

متن کامل

Dissecting the Stanley partition function

Let p(n) denote the number of unrestricted partitions of n. For i = 0, 2, let pi(n) denote the number of partitions π of n such that O(π)−O(π) ≡ i (mod 4). Here O(π) denotes the number of odd parts of the partition π and π is the conjugate of π. R. Stanley [13], [14] derived an infinite product representation for the generating function of p0(n)− p2(n). Recently, H. Swisher [15] employed the ci...

متن کامل

Congruences of the Partition Function

Ramanujan also conjectured that congruences (1) exist for the cases A = 5 , 7 , or 11 . This conjecture was proved by Watson [17] for the cases of powers of 5 and 7 and Atkin [3] for the cases of powers of 11. Since then, the problem of finding more examples of such congruences has attracted a great deal of attention. However, Ramanujan-type congruences appear to be very sparse. Prior to the la...

متن کامل

On Tracking The Partition Function

Markov Random Fields (MRFs) have proven very powerful both as density estimators and feature extractors for classification. However, their use is often limited by an inability to estimate the partition function Z. In this paper, we exploit the gradient descent training procedure of restricted Boltzmann machines (a type of MRF) to track the log partition function during learning. Our method reli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EPJ Web of Conferences

سال: 2018

ISSN: 2100-014X

DOI: 10.1051/epjconf/201819106005